Code-Based Conjunction Obfuscation

The pattern-matching problem with wildcards can be formulated as a conjunction where an accepting string is same the pattern for all non-wild-cards. A scheme of obfuscation algorithm that “encrypt” to prevent some adversary from forging any string. Since 2013, there are abundant works about which discussed weak/strong functionality preservation and distributed black-box security. These based on generic group model, learning error assumption, noise etc. Our work proposes first strong security standard assumption. parameter constraints also resist related attacks such information set decoding attack structured arrack.